Service-oriented agents for collaborative industrial automation and production systems

Service-oriented Multi-Agent Systems (SoMAS) is an approach to combine the fundamental characteristics of service-oriented and multi-agent methods into a new platform for industrial automation. Several research works already targeted the connection of these technologies, presenting different perspectives in how and why to join them. This research focuses on available efforts and solutions in the area of SoMAS and explains the idea behind the service-oriented agents in industrial automation. A SoMAS system is mainly composed by shared resources in form of services and their providing/requesting agents. The paper also discusses the required engineering aspects of these systems, from the internal anatomy to the interaction patterns. Parameters of flexibility, reconfiguration, autonomy and reduced development efforts were considered and they should be the trademark of SoMAS. Aiming to illustrate the proposed approach, an example of service-oriented automation agents is given.The authors would like to thank the European Commission and the partners of the EU IST FP6 project “Service-Oriented Cross-layer infrastructure for Distributed smart Embedded devices” (SOCRADES), the EU FP6 "Network of Excellence for Innovative Production Machines and Systems” (I*PROMS), and the EC ICT FP7 project “Cooperating Objects Network of Excellence” (CONET) for their support

C-IPS: Specifying decision interdependencies in negotiations

Abstract. Negotiation is an important mechanism of coordination in multiagent systems. Contrary to early conceptualizations of negotiating agents, we believe that decisions regarding the negotiation issue and the negotiation partner are equally important as the selection of negotiation steps. Our C-IPS approach considers these three aspects as separate decision processes. It requires an explicit specification of interdependencies between them. In this article we address the task of specifying the dynamic interdependencies by means of IPS dynamics. Thereby we introduce a new level of modeling negotiating agents that is above negotiation mechanism and protocol design. IPS dynamics are presented using state charts. We define some generally required states, predicates and actions. We illustrate the dynamics by a simple example. The example is first specified for an idealized scenario and is then extended to a more realistic model that captures some features of open multiagent systems. The well-structured reasoning process for negotiating agents enables more comprehensive and hence more flexible architectures. The explicit modeling of all involved decisions and dependencies eases the understanding, evaluation, and comparison of different approaches to negotiating agents.

A Requirement-centric Approach to Web Service Modeling, Discovery, and Selection

Service-Oriented Computing (SOC) has gained considerable popularity for implementing Service-Based Applications (SBAs) in a flexible\ud and effective manner. The basic idea of SOC is to understand users'\ud requirements for SBAs first, and then discover and select relevant\ud services (i.e., that fit closely functional requirements) and offer\ud a high Quality of Service (QoS). Understanding users’ requirements\ud is already achieved by existing requirement engineering approaches\ud (e.g., TROPOS, KAOS, and MAP) which model SBAs in a requirement-driven\ud manner. However, discovering and selecting relevant and high QoS\ud services are still challenging tasks that require time and effort\ud due to the increasing number of available Web services. In this paper,\ud we propose a requirement-centric approach which allows: (i) modeling\ud users’ requirements for SBAs with the MAP formalism and specifying\ud required services using an Intentional Service Model (ISM); (ii)\ud discovering services by querying the Web service search engine Service-Finder\ud and using keywords extracted from the specifications provided by\ud the ISM; and(iii) selecting automatically relevant and high QoS services\ud by applying Formal Concept Analysis (FCA). We validate our approach\ud by performing experiments on an e-books application. The experimental\ud results show that our approach allows the selection of relevant and\ud high QoS services with a high accuracy (the average precision is\ud 89.41%) and efficiency (the average recall is 95.43%)

Multiagent Negotiation for Fair and Unbiased Resource Allocation

This paper proposes a novel solution for the n agent cake cutting (resource allocation) problem. We propose a negotiation protocol for dividing a resource among n agents and then provide an algorithm for allotting portions of the resource. We prove that this protocol can enable distribution of the resource among n agents in a fair manner. The protocol enables agents to choose portions based on their internal utility function, which they do not have to reveal. In addition to being fair, the protocol has desirable features such as being unbiased and verifiable while allocating resources. In the case where the resource is two-dimensional (a circular cake) and uniform, it is shown that each agent can get close to l/n of the whole resource

Multi-agent systems and their role in future energy grids

This report documents the program and the outcomes of Dagstuhl Seminar 14181 “Multi-agent systems and their role in future energy grids”. A number of recent events (e. g. Fukushima, Japan, and the largest blackout in history, India) have once again increased global attention on climate change and resource depletion. The evaluation of the feasibility of current approaches for future energy generation, distribution, transportation, and consumption has become an important requirement for most countries. There is a general consensus on the need for a fundamental transformation of future energy grids. The development of an information and communication technology (ICT) support infrastructure was identified as the key challenge in the design of an end-to-end smart grid. A multiagent system, with agents located at th

Finding the Most Similar Concepts in Two Different Ontologies

Abstract. A concise manner to send information from agent A to B is to use phrases constructed with the concepts of A: to use the concepts as the atomic tokens to be transmitted. Unfortunately, tokens from A are not understood by (they do not map into) the ontology of B, since in general each ontology has its own address space. Instead, A and B need to use a common communication language, such as English: the transmission tokens are English words. An algorithm is presented that finds the concept cB in OB (the ontology of B) most closely resembling a given concept cA. That is, given a concept from ontology OA, a method is provided to find the most similar concept in OB, as well as the similarity sim between both concepts. Examples are given. 1 Introduction an

Programming Groups of Rational Agents

Abstract. In this paper, we consider the problem of effectively pro-gramming groups of agents. These groups should capture structuring mechanisms common in multi-agent systems, such as teams, cooperative groups, and organisations. Not only should individual agents be dynamic and evolving, but the groups in which the agents occur must be open, flexible and capable of similar evolution and restructuring. We enable the description and implementation of such groups by providing an extension to our previous work on programming languages for agent-based systems based on executable temporal and modal logics. With such formalism as a basis, we consider the grouping aspects within multi-agent systems. In particular, we describe how this logic-based approach to grouping has been implemented in Java and consider how this language can be used for developing multi-agent systems.